Coding techniques through Fibonacci webs, difference cordial labeling and GMJ code method
نویسندگان
چکیده
منابع مشابه
3-difference cordial labeling of some cycle related graphs
Let G be a (p, q) graph. Let k be an integer with 2 ≤ k ≤ p and f from V (G) to the set {1, 2, . . . , k} be a map. For each edge uv, assign the label |f(u) − f(v)|. The function f is called a k-difference cordial labeling of G if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
متن کاملDifference Cordial Labeling of Subdivision of Snake Graphs
Let G be a (p, q) graph. Let f : V (G) → {1, 2 . . . , p} be a function. For each edge uv, assign the label |f (u)− f (v)|. f is called a difference cordial labeling if f is a one to one map and |ef (0)− ef (1)| ≤ 1 where ef (1) and ef (0) denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with a difference cordial labeling is called a difference cordial grap...
متن کاملOn k-cordial labeling
Hovey [Discrete Math. 93 (1991), 183–194] introduced simultaneous generalizations of harmonious and cordial labellings. He defines a graph G of vertex set V (G) and edge set E(G) to be k-cordial if there is a vertex labelling f from V (G) to Zk, the group of integers modulo k, so that when each edge xy is assigned the label (f(x) + f(y)) (mod k), the number of vertices (respectively, edges) lab...
متن کامل3-difference cordial labeling of some cycle related graphs
let g be a (p, q) graph. let k be an integer with 2 ≤ k ≤ p and f from v (g) to the set {1, 2, . . . , k} be a map. for each edge uv, assign the label |f(u) − f(v)|. the function f is called a k-difference cordial labeling of g if |νf (i) − vf (j)| ≤ 1 and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labelled with x (x ∈ {1, 2 . . . , k}), ef (1) and ef (0) respectively den...
متن کاملRemainder Cordial Labeling of Graphs
In this paper we introduce remainder cordial labeling of graphs. Let $G$ be a $(p,q)$ graph. Let $f:V(G)rightarrow {1,2,...,p}$ be a $1-1$ map. For each edge $uv$ assign the label $r$ where $r$ is the remainder when $f(u)$ is divided by $f(v)$ or $f(v)$ is divided by $f(u)$ according as $f(u)geq f(v)$ or $f(v)geq f(u)$. The function$f$ is called a remainder cordial labeling of $G$ if $left| e_{...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2018
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1139/1/012077